1227. Andy’s first dictionary

Andy has a dream – he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the words himself, he has a brilliant idea. From his bookshelf he would pick one of his favorite story books, from which he would copy out all the distinct words. By arranging the words in alphabetical order, he is done! Of course, it is a really time-consuming job, and this is where a computer program is helpful.

You are asked to write a program that lists all the different words in the input text. In this problem, a word is defined as a consecutive sequence of Latin alphabets, in upper and/or lower case. Words with only one letter are also to be considered. Furthermore, your program must be CaSe InSeNsItIvE. For example, words like “Apple”, “apple” or “APPLE” must be considered the same.

Input. The input file is a text with no more than 5000 lines. An input line has at most 200 characters.

Output. Your output should give a list of different words that appears in the input text, one in a line. The words should all be in lower case, sorted in alphabetical order. You can be sure that the number of distinct words in the text does not exceed 6000.

Sample input

Adventures in Disneyland
 
Two blondes were going to Disneyland when they came to a fork in the
road. The sign read: "Disneyland Left."
 
So they went home.

Sample output

a
adventures
blondes
came
disneyland
fork
going
home
in
left
read
road
sign
so
the
they
to
two
went
were
when

SOLUTION

data structures - set

Algorithm analysis

Read the text, pick out the words, consisting of symbols from Latin alphabet, and insert them into set container. The words will be sorted automatically. If some word is repeated in the text, it would be inserted into set only once. Then using iterator sequentially print the words. If the sequence of characters contains the apostrophe (for example andy’s), then consider such sequence as two different words: andy and s.

Algorithm realization

Declare the variable SetS of type set<string>, into which we shall insert the found word. We shall read the input words into the character array s.

set<string> SetS;

set<string>::iterator iter;

char s[201];

As the text not surely starts with a character of Latin alphabet, skip the starting symbols that are not letters.

scanf("%[^a-zA-Z]",s);

Read the word, consisting of only uppercase and lowercase letters of Latin alphabet, into the variable s. Change all letters to lowercase and insert the word into the set SetS. Skip all the symbols that are not letters, reading them into array s.

while(scanf("%[a-zA-Z]",s) == 1)

{

for(int i = 0; i < strlen(s); i++) s[i] = tolower(s[i]);

SetS.insert(s);

scanf("%[^a-zA-Z]",s);

}

Print the words in alphabetical order.

for(iter = SetS.begin(); iter != SetS.end(); iter++)

printf("%s\n",(*iter).c_str());